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/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:16:26,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:16:26,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:16:26,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:16:26,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:16:26,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:16:26,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:16:26,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:16:26,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:16:26,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:16:26,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:16:26,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:16:26,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:16:26,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:16:26,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:16:26,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:16:26,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:16:26,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:16:26,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:16:26,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:16:26,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:16:26,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:16:26,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:16:26,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:16:26,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:16:26,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:16:26,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:16:26,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:16:26,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:16:26,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:16:26,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:16:26,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:16:26,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:16:26,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:16:26,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:16:26,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:16:26,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:16:26,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:16:26,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:16:26,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:16:26,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:16:26,884 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-08 07:16:26,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:16:26,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:16:26,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:16:26,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:16:26,905 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:16:26,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:16:26,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:16:26,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:16:26,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:16:26,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:16:26,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:16:26,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:16:26,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:16:26,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:16:26,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:16:26,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:16:26,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:16:26,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:16:26,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:16:26,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:16:26,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:16:26,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:16:26,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:16:26,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:16:26,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:16:26,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:16:26,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:16:26,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:16:26,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:16:26,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:16:26,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:16:26,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:16:26,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:16:26,977 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:16:26,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 07:16:27,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc38cd1b/f2ec57f7429b49ce8edf16defddb52a9/FLAG62cbe3bb6 [2019-09-08 07:16:27,626 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:16:27,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 07:16:27,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc38cd1b/f2ec57f7429b49ce8edf16defddb52a9/FLAG62cbe3bb6 [2019-09-08 07:16:27,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc38cd1b/f2ec57f7429b49ce8edf16defddb52a9 [2019-09-08 07:16:27,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:16:27,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:16:27,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:16:27,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:16:27,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:16:27,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:16:27" (1/1) ... [2019-09-08 07:16:27,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c64650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:27, skipping insertion in model container [2019-09-08 07:16:27,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:16:27" (1/1) ... [2019-09-08 07:16:27,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:16:27,965 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:16:28,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:16:28,340 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:16:28,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:16:28,425 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:16:28,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28 WrapperNode [2019-09-08 07:16:28,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:16:28,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:16:28,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:16:28,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:16:28,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (1/1) ... [2019-09-08 07:16:28,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:16:28,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:16:28,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:16:28,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:16:28,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (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-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:16:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:16:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:16:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:16:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:16:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:16:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:16:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:16:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:16:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:16:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:16:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:16:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:16:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:16:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:16:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:16:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:16:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:16:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:16:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:16:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:16:29,408 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:16:29,409 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:16:29,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:16:29 BoogieIcfgContainer [2019-09-08 07:16:29,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:16:29,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:16:29,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:16:29,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:16:29,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:16:27" (1/3) ... [2019-09-08 07:16:29,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178263ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:16:29, skipping insertion in model container [2019-09-08 07:16:29,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:16:28" (2/3) ... [2019-09-08 07:16:29,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178263ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:16:29, skipping insertion in model container [2019-09-08 07:16:29,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:16:29" (3/3) ... [2019-09-08 07:16:29,418 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-08 07:16:29,427 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:16:29,436 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:16:29,454 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:16:29,487 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:16:29,488 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:16:29,488 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:16:29,489 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:16:29,489 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:16:29,489 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:16:29,489 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:16:29,489 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:16:29,490 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:16:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-08 07:16:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 07:16:29,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:29,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:29,526 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 599968013, now seen corresponding path program 1 times [2019-09-08 07:16:29,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:29,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:30,029 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-08 07:16:30,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:30,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:16:30,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:16:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:16:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:16:30,069 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 5 states. [2019-09-08 07:16:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:30,301 INFO L93 Difference]: Finished difference Result 252 states and 405 transitions. [2019-09-08 07:16:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:16:30,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 07:16:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:30,326 INFO L225 Difference]: With dead ends: 252 [2019-09-08 07:16:30,326 INFO L226 Difference]: Without dead ends: 153 [2019-09-08 07:16:30,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:16:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-08 07:16:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-09-08 07:16:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 07:16:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-09-08 07:16:30,411 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 56 [2019-09-08 07:16:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:30,412 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-09-08 07:16:30,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:16:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-09-08 07:16:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 07:16:30,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:30,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:30,422 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash -981393308, now seen corresponding path program 1 times [2019-09-08 07:16:30,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:30,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:30,680 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-08 07:16:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:16:30,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:16:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:16:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:16:30,685 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 9 states. [2019-09-08 07:16:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:33,296 INFO L93 Difference]: Finished difference Result 951 states and 1481 transitions. [2019-09-08 07:16:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 07:16:33,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 07:16:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:33,311 INFO L225 Difference]: With dead ends: 951 [2019-09-08 07:16:33,311 INFO L226 Difference]: Without dead ends: 861 [2019-09-08 07:16:33,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 07:16:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-08 07:16:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 589. [2019-09-08 07:16:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 07:16:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 906 transitions. [2019-09-08 07:16:33,396 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 906 transitions. Word has length 82 [2019-09-08 07:16:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:33,397 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 906 transitions. [2019-09-08 07:16:33,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:16:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 906 transitions. [2019-09-08 07:16:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 07:16:33,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:33,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:33,402 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1956808491, now seen corresponding path program 1 times [2019-09-08 07:16:33,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:33,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:33,634 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-08 07:16:33,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:33,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:16:33,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:16:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:16:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:16:33,639 INFO L87 Difference]: Start difference. First operand 589 states and 906 transitions. Second operand 6 states. [2019-09-08 07:16:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:34,747 INFO L93 Difference]: Finished difference Result 1663 states and 2586 transitions. [2019-09-08 07:16:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:16:34,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 07:16:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:34,762 INFO L225 Difference]: With dead ends: 1663 [2019-09-08 07:16:34,762 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 07:16:34,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:16:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 07:16:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 863. [2019-09-08 07:16:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-08 07:16:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1330 transitions. [2019-09-08 07:16:34,874 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1330 transitions. Word has length 83 [2019-09-08 07:16:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:34,875 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1330 transitions. [2019-09-08 07:16:34,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:16:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1330 transitions. [2019-09-08 07:16:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 07:16:34,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:34,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:34,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2113374267, now seen corresponding path program 1 times [2019-09-08 07:16:34,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:34,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:35,072 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-08 07:16:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:16:35,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:16:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:16:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:16:35,074 INFO L87 Difference]: Start difference. First operand 863 states and 1330 transitions. Second operand 6 states. [2019-09-08 07:16:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:36,163 INFO L93 Difference]: Finished difference Result 4099 states and 6398 transitions. [2019-09-08 07:16:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:16:36,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-08 07:16:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:36,215 INFO L225 Difference]: With dead ends: 4099 [2019-09-08 07:16:36,215 INFO L226 Difference]: Without dead ends: 3299 [2019-09-08 07:16:36,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:16:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-09-08 07:16:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2477. [2019-09-08 07:16:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-09-08 07:16:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3850 transitions. [2019-09-08 07:16:36,359 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3850 transitions. Word has length 84 [2019-09-08 07:16:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:36,359 INFO L475 AbstractCegarLoop]: Abstraction has 2477 states and 3850 transitions. [2019-09-08 07:16:36,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:16:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3850 transitions. [2019-09-08 07:16:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 07:16:36,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:36,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:36,363 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -611664052, now seen corresponding path program 1 times [2019-09-08 07:16:36,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:36,463 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-08 07:16:36,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:36,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:16:36,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:16:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:16:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:16:36,466 INFO L87 Difference]: Start difference. First operand 2477 states and 3850 transitions. Second operand 6 states. [2019-09-08 07:16:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:38,085 INFO L93 Difference]: Finished difference Result 12260 states and 19140 transitions. [2019-09-08 07:16:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:16:38,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-08 07:16:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:38,146 INFO L225 Difference]: With dead ends: 12260 [2019-09-08 07:16:38,146 INFO L226 Difference]: Without dead ends: 9846 [2019-09-08 07:16:38,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:16:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2019-09-08 07:16:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 9792. [2019-09-08 07:16:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9792 states. [2019-09-08 07:16:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 15169 transitions. [2019-09-08 07:16:38,655 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 15169 transitions. Word has length 85 [2019-09-08 07:16:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:38,657 INFO L475 AbstractCegarLoop]: Abstraction has 9792 states and 15169 transitions. [2019-09-08 07:16:38,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:16:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 15169 transitions. [2019-09-08 07:16:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 07:16:38,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:38,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:38,666 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1246306044, now seen corresponding path program 1 times [2019-09-08 07:16:38,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:38,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:38,927 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-08 07:16:38,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:38,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:16:38,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:16:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:16:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:16:38,931 INFO L87 Difference]: Start difference. First operand 9792 states and 15169 transitions. Second operand 6 states. [2019-09-08 07:16:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:40,582 INFO L93 Difference]: Finished difference Result 36721 states and 57328 transitions. [2019-09-08 07:16:40,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:16:40,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-08 07:16:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:40,729 INFO L225 Difference]: With dead ends: 36721 [2019-09-08 07:16:40,729 INFO L226 Difference]: Without dead ends: 26992 [2019-09-08 07:16:40,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:16:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26992 states. [2019-09-08 07:16:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26992 to 26640. [2019-09-08 07:16:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26640 states. [2019-09-08 07:16:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26640 states to 26640 states and 40329 transitions. [2019-09-08 07:16:42,193 INFO L78 Accepts]: Start accepts. Automaton has 26640 states and 40329 transitions. Word has length 87 [2019-09-08 07:16:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:42,194 INFO L475 AbstractCegarLoop]: Abstraction has 26640 states and 40329 transitions. [2019-09-08 07:16:42,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:16:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 26640 states and 40329 transitions. [2019-09-08 07:16:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 07:16:42,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:42,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:42,197 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:42,198 INFO L82 PathProgramCache]: Analyzing trace with hash -311105867, now seen corresponding path program 1 times [2019-09-08 07:16:42,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:42,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:42,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:42,339 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-08 07:16:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:16:42,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:16:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:16:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:16:42,341 INFO L87 Difference]: Start difference. First operand 26640 states and 40329 transitions. Second operand 5 states. [2019-09-08 07:16:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:44,885 INFO L93 Difference]: Finished difference Result 79339 states and 122347 transitions. [2019-09-08 07:16:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:16:44,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 07:16:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:45,171 INFO L225 Difference]: With dead ends: 79339 [2019-09-08 07:16:45,171 INFO L226 Difference]: Without dead ends: 52713 [2019-09-08 07:16:45,274 INFO L628 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-08 07:16:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52713 states. [2019-09-08 07:16:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52713 to 52711. [2019-09-08 07:16:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52711 states. [2019-09-08 07:16:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52711 states to 52711 states and 78750 transitions. [2019-09-08 07:16:47,804 INFO L78 Accepts]: Start accepts. Automaton has 52711 states and 78750 transitions. Word has length 89 [2019-09-08 07:16:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:47,805 INFO L475 AbstractCegarLoop]: Abstraction has 52711 states and 78750 transitions. [2019-09-08 07:16:47,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:16:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 52711 states and 78750 transitions. [2019-09-08 07:16:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 07:16:47,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:47,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:47,809 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -92550679, now seen corresponding path program 1 times [2019-09-08 07:16:47,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:47,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:47,886 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-08 07:16:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:16:47,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:16:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:16:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:16:47,888 INFO L87 Difference]: Start difference. First operand 52711 states and 78750 transitions. Second operand 3 states. [2019-09-08 07:16:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:50,358 INFO L93 Difference]: Finished difference Result 78877 states and 117733 transitions. [2019-09-08 07:16:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:16:50,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 07:16:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:50,612 INFO L225 Difference]: With dead ends: 78877 [2019-09-08 07:16:50,612 INFO L226 Difference]: Without dead ends: 52807 [2019-09-08 07:16:50,676 INFO L628 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-08 07:16:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52807 states. [2019-09-08 07:16:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52807 to 52713. [2019-09-08 07:16:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52713 states. [2019-09-08 07:16:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52713 states to 52713 states and 78752 transitions. [2019-09-08 07:16:52,496 INFO L78 Accepts]: Start accepts. Automaton has 52713 states and 78752 transitions. Word has length 90 [2019-09-08 07:16:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:16:52,497 INFO L475 AbstractCegarLoop]: Abstraction has 52713 states and 78752 transitions. [2019-09-08 07:16:52,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:16:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52713 states and 78752 transitions. [2019-09-08 07:16:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:16:52,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:16:52,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:16:52,501 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:16:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:16:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 988708442, now seen corresponding path program 1 times [2019-09-08 07:16:52,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:16:52,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:16:52,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:52,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:16:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:16:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:16:52,632 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-08 07:16:52,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:16:52,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:16:52,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:16:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:16:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:16:52,634 INFO L87 Difference]: Start difference. First operand 52713 states and 78752 transitions. Second operand 5 states. [2019-09-08 07:16:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:16:55,369 INFO L93 Difference]: Finished difference Result 156982 states and 239521 transitions. [2019-09-08 07:16:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:16:55,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 07:16:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:16:55,798 INFO L225 Difference]: With dead ends: 156982 [2019-09-08 07:16:55,799 INFO L226 Difference]: Without dead ends: 104296 [2019-09-08 07:16:55,935 INFO L628 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-08 07:16:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104296 states. [2019-09-08 07:17:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104296 to 104294. [2019-09-08 07:17:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104294 states. [2019-09-08 07:17:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104294 states to 104294 states and 153698 transitions. [2019-09-08 07:17:01,141 INFO L78 Accepts]: Start accepts. Automaton has 104294 states and 153698 transitions. Word has length 91 [2019-09-08 07:17:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:01,142 INFO L475 AbstractCegarLoop]: Abstraction has 104294 states and 153698 transitions. [2019-09-08 07:17:01,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:17:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 104294 states and 153698 transitions. [2019-09-08 07:17:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:17:01,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:01,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:17:01,149 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -895226652, now seen corresponding path program 1 times [2019-09-08 07:17:01,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:01,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:01,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:01,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:01,246 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-08 07:17:01,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:01,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:17:01,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:17:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:17:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:17:01,248 INFO L87 Difference]: Start difference. First operand 104294 states and 153698 transitions. Second operand 5 states. [2019-09-08 07:17:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:07,297 INFO L93 Difference]: Finished difference Result 266242 states and 396492 transitions. [2019-09-08 07:17:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:17:07,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 07:17:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:07,852 INFO L225 Difference]: With dead ends: 266242 [2019-09-08 07:17:07,861 INFO L226 Difference]: Without dead ends: 162160 [2019-09-08 07:17:08,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:17:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162160 states. [2019-09-08 07:17:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162160 to 162158. [2019-09-08 07:17:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162158 states. [2019-09-08 07:17:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162158 states to 162158 states and 239850 transitions. [2019-09-08 07:17:15,522 INFO L78 Accepts]: Start accepts. Automaton has 162158 states and 239850 transitions. Word has length 91 [2019-09-08 07:17:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:15,522 INFO L475 AbstractCegarLoop]: Abstraction has 162158 states and 239850 transitions. [2019-09-08 07:17:15,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:17:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 162158 states and 239850 transitions. [2019-09-08 07:17:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:17:15,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:15,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:17:15,527 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:15,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1531600991, now seen corresponding path program 1 times [2019-09-08 07:17:15,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:15,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:15,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:15,624 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-08 07:17:15,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:15,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:17:15,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:17:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:17:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:15,625 INFO L87 Difference]: Start difference. First operand 162158 states and 239850 transitions. Second operand 4 states. [2019-09-08 07:17:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:18,541 INFO L93 Difference]: Finished difference Result 202696 states and 299809 transitions. [2019-09-08 07:17:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:17:18,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 07:17:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:18,903 INFO L225 Difference]: With dead ends: 202696 [2019-09-08 07:17:18,903 INFO L226 Difference]: Without dead ends: 122398 [2019-09-08 07:17:19,036 INFO L628 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-08 07:17:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122398 states. [2019-09-08 07:17:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122398 to 122398. [2019-09-08 07:17:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122398 states. [2019-09-08 07:17:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122398 states to 122398 states and 181332 transitions. [2019-09-08 07:17:25,670 INFO L78 Accepts]: Start accepts. Automaton has 122398 states and 181332 transitions. Word has length 91 [2019-09-08 07:17:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:25,670 INFO L475 AbstractCegarLoop]: Abstraction has 122398 states and 181332 transitions. [2019-09-08 07:17:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:17:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 122398 states and 181332 transitions. [2019-09-08 07:17:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:17:25,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:25,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:17:25,674 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1434429109, now seen corresponding path program 1 times [2019-09-08 07:17:25,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:25,769 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-08 07:17:25,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:17:25,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:17:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:17:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:17:25,771 INFO L87 Difference]: Start difference. First operand 122398 states and 181332 transitions. Second operand 5 states. [2019-09-08 07:17:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:30,020 INFO L93 Difference]: Finished difference Result 304190 states and 448895 transitions. [2019-09-08 07:17:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:17:30,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:17:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:30,527 INFO L225 Difference]: With dead ends: 304190 [2019-09-08 07:17:30,528 INFO L226 Difference]: Without dead ends: 181962 [2019-09-08 07:17:30,673 INFO L628 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-08 07:17:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181962 states. [2019-09-08 07:17:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181962 to 168955. [2019-09-08 07:17:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168955 states. [2019-09-08 07:17:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168955 states to 168955 states and 252018 transitions. [2019-09-08 07:17:39,276 INFO L78 Accepts]: Start accepts. Automaton has 168955 states and 252018 transitions. Word has length 93 [2019-09-08 07:17:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:17:39,276 INFO L475 AbstractCegarLoop]: Abstraction has 168955 states and 252018 transitions. [2019-09-08 07:17:39,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:17:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 168955 states and 252018 transitions. [2019-09-08 07:17:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:17:39,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:17:39,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:17:39,280 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:17:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:17:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2142671705, now seen corresponding path program 1 times [2019-09-08 07:17:39,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:17:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:17:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:17:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:17:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:17:39,353 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-08 07:17:39,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:17:39,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:17:39,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:17:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:17:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:17:39,355 INFO L87 Difference]: Start difference. First operand 168955 states and 252018 transitions. Second operand 4 states. [2019-09-08 07:17:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:17:50,597 INFO L93 Difference]: Finished difference Result 467597 states and 715507 transitions. [2019-09-08 07:17:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:17:50,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 07:17:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:17:51,317 INFO L225 Difference]: With dead ends: 467597 [2019-09-08 07:17:51,318 INFO L226 Difference]: Without dead ends: 298812 [2019-09-08 07:17:51,535 INFO L628 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-08 07:17:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298812 states. [2019-09-08 07:18:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298812 to 298808. [2019-09-08 07:18:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298808 states. [2019-09-08 07:18:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298808 states to 298808 states and 436843 transitions. [2019-09-08 07:18:01,017 INFO L78 Accepts]: Start accepts. Automaton has 298808 states and 436843 transitions. Word has length 93 [2019-09-08 07:18:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:01,017 INFO L475 AbstractCegarLoop]: Abstraction has 298808 states and 436843 transitions. [2019-09-08 07:18:01,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:18:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 298808 states and 436843 transitions. [2019-09-08 07:18:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:18:01,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:01,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:18:01,022 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1446688205, now seen corresponding path program 1 times [2019-09-08 07:18:01,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:01,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:01,161 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-08 07:18:01,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:18:01,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:18:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:18:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:18:01,163 INFO L87 Difference]: Start difference. First operand 298808 states and 436843 transitions. Second operand 10 states. [2019-09-08 07:18:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:16,228 INFO L93 Difference]: Finished difference Result 568631 states and 836578 transitions. [2019-09-08 07:18:16,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:18:16,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 07:18:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:17,422 INFO L225 Difference]: With dead ends: 568631 [2019-09-08 07:18:17,423 INFO L226 Difference]: Without dead ends: 389183 [2019-09-08 07:18:17,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:18:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389183 states. [2019-09-08 07:18:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389183 to 299167. [2019-09-08 07:18:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299167 states. [2019-09-08 07:18:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299167 states to 299167 states and 437392 transitions. [2019-09-08 07:18:35,985 INFO L78 Accepts]: Start accepts. Automaton has 299167 states and 437392 transitions. Word has length 94 [2019-09-08 07:18:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:18:35,986 INFO L475 AbstractCegarLoop]: Abstraction has 299167 states and 437392 transitions. [2019-09-08 07:18:35,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:18:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 299167 states and 437392 transitions. [2019-09-08 07:18:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:18:35,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:18:35,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:18:35,991 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:18:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:18:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1306139595, now seen corresponding path program 1 times [2019-09-08 07:18:35,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:18:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:18:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:35,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:18:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:18:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:18:36,110 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-08 07:18:36,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:18:36,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:18:36,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:18:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:18:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:18:36,111 INFO L87 Difference]: Start difference. First operand 299167 states and 437392 transitions. Second operand 9 states. [2019-09-08 07:18:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:18:56,389 INFO L93 Difference]: Finished difference Result 507547 states and 744132 transitions. [2019-09-08 07:18:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:18:56,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 07:18:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:18:57,566 INFO L225 Difference]: With dead ends: 507547 [2019-09-08 07:18:57,567 INFO L226 Difference]: Without dead ends: 418991 [2019-09-08 07:18:57,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:18:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418991 states. [2019-09-08 07:19:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418991 to 342979. [2019-09-08 07:19:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342979 states. [2019-09-08 07:19:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342979 states to 342979 states and 500242 transitions. [2019-09-08 07:19:18,018 INFO L78 Accepts]: Start accepts. Automaton has 342979 states and 500242 transitions. Word has length 94 [2019-09-08 07:19:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:18,019 INFO L475 AbstractCegarLoop]: Abstraction has 342979 states and 500242 transitions. [2019-09-08 07:19:18,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:19:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 342979 states and 500242 transitions. [2019-09-08 07:19:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:19:18,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:18,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:19:18,024 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash 896462566, now seen corresponding path program 1 times [2019-09-08 07:19:18,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:18,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:18,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:18,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:18,129 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-08 07:19:18,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:18,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:18,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:18,132 INFO L87 Difference]: Start difference. First operand 342979 states and 500242 transitions. Second operand 5 states. [2019-09-08 07:19:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:51,550 INFO L93 Difference]: Finished difference Result 1018107 states and 1503738 transitions. [2019-09-08 07:19:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:19:51,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 07:19:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:53,591 INFO L225 Difference]: With dead ends: 1018107 [2019-09-08 07:19:53,592 INFO L226 Difference]: Without dead ends: 675166 [2019-09-08 07:19:54,860 INFO L628 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-08 07:19:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675166 states. [2019-09-08 07:20:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675166 to 675164. [2019-09-08 07:20:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675164 states. [2019-09-08 07:20:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675164 states to 675164 states and 970851 transitions. [2019-09-08 07:20:33,261 INFO L78 Accepts]: Start accepts. Automaton has 675164 states and 970851 transitions. Word has length 95 [2019-09-08 07:20:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:33,261 INFO L475 AbstractCegarLoop]: Abstraction has 675164 states and 970851 transitions. [2019-09-08 07:20:33,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 675164 states and 970851 transitions. [2019-09-08 07:20:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 07:20:33,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:33,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:20:33,267 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -864175734, now seen corresponding path program 1 times [2019-09-08 07:20:33,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:33,359 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-08 07:20:33,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:33,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:20:33,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:20:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:20:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:33,360 INFO L87 Difference]: Start difference. First operand 675164 states and 970851 transitions. Second operand 7 states. [2019-09-08 07:21:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:18,043 INFO L93 Difference]: Finished difference Result 1153292 states and 1657720 transitions. [2019-09-08 07:21:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:21:18,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 07:21:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:21,535 INFO L225 Difference]: With dead ends: 1153292 [2019-09-08 07:21:21,536 INFO L226 Difference]: Without dead ends: 826158 [2019-09-08 07:21:22,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:21:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826158 states. [2019-09-08 07:22:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826158 to 823486. [2019-09-08 07:22:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823486 states. [2019-09-08 07:22:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823486 states to 823486 states and 1183809 transitions. [2019-09-08 07:22:26,998 INFO L78 Accepts]: Start accepts. Automaton has 823486 states and 1183809 transitions. Word has length 96 [2019-09-08 07:22:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:26,998 INFO L475 AbstractCegarLoop]: Abstraction has 823486 states and 1183809 transitions. [2019-09-08 07:22:26,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:22:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 823486 states and 1183809 transitions. [2019-09-08 07:22:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 07:22:27,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:27,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:22:27,004 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash -730162228, now seen corresponding path program 1 times [2019-09-08 07:22:27,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:27,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:27,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:27,146 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-08 07:22:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:27,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:22:27,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:22:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:22:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:22:27,147 INFO L87 Difference]: Start difference. First operand 823486 states and 1183809 transitions. Second operand 10 states. [2019-09-08 07:23:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:23:48,380 INFO L93 Difference]: Finished difference Result 1994144 states and 2911769 transitions. [2019-09-08 07:23:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 07:23:48,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-09-08 07:23:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:23:53,204 INFO L225 Difference]: With dead ends: 1994144 [2019-09-08 07:23:53,204 INFO L226 Difference]: Without dead ends: 1352880 [2019-09-08 07:23:55,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:23:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352880 states.